Provably Secure Cryptographic Hash Functions
نویسندگان
چکیده
The work on this thesis was part of a Study Abroad year at the University of New South Wales, Sydney. It has been a very valuable academic and personal experience, and thanks go to the many people who have supported and inspired me throughout this year. For the support with the work on this thesis, the greatest thanks go to my supervisors Jim Franklin and Richard Buckland. To Jim, for his never-ending supply of time and patience, and for his interest in every aspect of my studies. And to Richard, for his brilliant ideas and guidance. Also to Roland, my inofficial third supervisor, who spent enormous amounts of time helping me with all kinds of smaller and bigger problems. I would also like to thank Catherine Greenhill for her friendly advice regarding several graph theory questions. Thank you to Jim, James, Roland and Tara, who willingly offered to help with proofreading the entire document to fix my English, layout, logic and notation. Lastly, for their loving support and faithful prayers, thanks must go to my family and friends, and especially to Bec.
منابع مشابه
A Fast Provably Secure Cryptographic Hash Function
We propose a family of fast and provably secure cryptographic hash functions. The security of these functions relies directly on the well-known syndrome decoding problem for linear codes. Attacks on this problem are well identified and their complexity is known. This enables us to study precisely the practical security of the hash functions and propose valid parameters for implementation. Furth...
متن کاملCryptanalysis of a Provably Secure Cryptographic Hash Function
We present a cryptanalysis of a provably secure cryptographic hash function proposed by Augot, Finiasz and Sendrier in [1]. Our attack is a variant of Wagner’s generalized birthday attack. It is significantly faster than the attack considered in [1], and it is practical for two of the three proposed parameters.
متن کاملProvably Secure One-Way Hash Functions
This paper surveys recent progress on the construction of provably secure one-way hash functions, under gradually weakened assumptions. One-way hash functions have many cryptographic applications. In digital signatures, they are used to compress long input strings prior to actual signing procedures. This usually greatly improves the overall efficiency of a signature scheme. They are also used t...
متن کاملEfficiency and pseudo-randomness of a variant of Zémor-Tillich hash function
Recent breakthroughs concerning the current standard SHA-1 prompted NIST to launch a competition for a new secure hash algorithm [1,13]. Provably secure hash functions (in the sense that their security relates to the hardness of some mathematical problems [5,7,9,12]) are particularly interesting from a theoretical point of view but are often much slower than heuristic functions like SHA. In thi...
متن کاملXMSS - A Practical Forward Secure Signature Scheme Based on Minimal Security Assumptions
We present the hash-based signature scheme XMSS. It is the first provably (forward) secure and practical signature scheme with minimal security requirements: a pseudorandom and a second preimage resistant (hash) function family. Its signature size is reduced to less than 25% compared to the best provably secure hash based signature scheme.
متن کاملOn the Performance of Provably Secure Hashing with Elliptic Curves
We propose a cryptographic hash function based on the difficulty of computing discrete logarithms in the group of points of an elliptic curve over a finite field. We prove the security of the hash function and analyze the performance. Our implementation of the finite field, the elliptic curve arithmetic, and scalar multiplication is optimized for high throughput on modern 32-bit desktop process...
متن کامل